Stable marriages: Substituting linearity for discreteness
نویسندگان
چکیده
منابع مشابه
Communication Requirements for Stable Marriages
We study the stable marriage problem in a distributed environment, in which there are 2n players, n men and n women, each holding a private ranking of the n persons of the opposite set, and there is a server who communicates with the players and finds a matching for them. We restrict our attention on two communication models: the sketch model and the query model. In the sketch model, each playe...
متن کاملFast distributed almost stable marriages
In their seminal work on the Stable Marriage Problem, Gale and Shapley [3] describe an algorithm which finds a stable marriage in O(n) communication rounds. Their algorithm has a natural interpretation as a distributed algorithm where each player is represented by a single processor. The complexity measure of such a distributed algorithm is typically measured by the round complexity, assuming a...
متن کاملStable marriages and search frictions
Stable matchings are the primary solution concept for two-sided matching markets with nontransferable utility. We investigate the strategic foundations of stability in a decentralized matching market. Towards this end, we embed the standard marriage markets in a search model with random meetings. We study the limit of steady-state equilibria as exogenous frictions vanish. The main result is tha...
متن کاملPrivate and Efficient Stable Marriages (Matching)
We provide algorithms guaranteeing high levels of privacy by computing uniformly random solutions to stable marriages problems. We also provide efficient algorithms extracting a nonuniformly random solution and guaranteeing t-privacy for any threshold t. The most private solution is expensive and is based on a distributed/shared CSP model of the problem. The most efficient version is based on r...
متن کاملStable-marriages algorithm for preprocessing phase maps with discontinuity sources.
A new algorithm is proposed for solving the problems associated with discontinuity sources in phase maps. It is based on the stable-marriages algorithm and is implemented as a recursive procedure.With this technique, discontinuity sources of opposite sign are connected by a set of cut lines that fulfills a stability criterion and possesses the minimum cut length of the stable sets. Th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1992
ISSN: 0024-3795
DOI: 10.1016/0024-3795(92)90359-i